Rocketsled: a software library for optimizing high-throughput computational searches
نویسندگان
چکیده
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملHigh throughput docking for library design and library prioritization.
The prioritization of the screening of combinatorial libraries is an extremely important task for the rapid identification of tight binding ligands and ultimately pharmaceutical compounds. When structural information for the target is available, molecular docking is an approach that can be used for prioritization. Here, we present the initial validation of a new rapid approach to molecular dock...
متن کاملA High-Throughput Method for Illumina RNA-Seq Library Preparation
With the introduction of cost effective, rapid, and superior quality next generation sequencing techniques, gene expression analysis has become viable for labs conducting small projects as well as large-scale gene expression analysis experiments. However, the available protocols for construction of RNA-sequencing (RNA-Seq) libraries are expensive and/or difficult to scale for high-throughput ap...
متن کاملHigh-Performance Library Software for QR Factorization
In 5, 6], we presented algorithm RGEQR3, a purely recur-sive formulation of the QR factorization. Using recursion leads us to a natural way to choose the k-way aggregating Householder transform of Schreiber and Van Loan 10]. RGEQR3 is a performance critical sub-routine for the main (hybrid recursive) routine RGEQRF for QR fac-torization of a general m n matrix. This contribution presents a new ...
متن کاملOptimizing persistent random searches.
We consider a minimal model of persistent random searcher with a short range memory. We calculate exactly for such a searcher the mean first-passage time to a target in a bounded domain and find that it admits a nontrivial minimum as function of the persistence length. This reveals an optimal search strategy which differs markedly from the simple ballistic motion obtained in the case of Poisson...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Materials
سال: 2019
ISSN: 2515-7639
DOI: 10.1088/2515-7639/ab0c3d